An Improved Lower Bound for Stack Sorting
نویسنده
چکیده
We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort n elements to 0.561 log 2 n+O(1). This is the first significant improvement since the previous lower bound, 1 2 log 2 n+O(1), was established by Knuth in 1972.
منابع مشابه
The Complexity of Sorting with Networks of Stacks and Queues
We consider a sorting problem on networks whose nodes are storage elements of type stack or queue. A railway switchyard could be an instance of such a network. Given is an input node where a permutation of items 1 to n is delivered and an output node where they are expected in sorted order. How many moves, where an item is transfered from one node to an adjacent node, are needed in the worst ca...
متن کاملSorting Using Networks of Stacks and Queues
We consider a sorting problem on networks whose nodes are storage elements of type stack or queue. A railway switchyard could be an instance of such a network. Given is an input node where a permutation of items 1 to n is delivered and an output node where they are expected in sorted order. How many moves, where an item is transfered from one node to an adjacent node, are needed in the worst ca...
متن کاملOn average and highest number of flips in pancake sorting
We are given a stack of pancakes of different sizes and the only allowed operation is to take several pancakes from top and flip them. The unburnt version requires the pancakes to be sorted by their sizes at the end, while in the burnt version they additionally need to be oriented burnt-side down. We present an algorithm with the average number of flips, needed to sort a stack of n burnt pancak...
متن کاملImproved Cramer-Rao Inequality for Randomly Censored Data
As an application of the improved Cauchy-Schwartz inequality due to Walker (Statist. Probab. Lett. (2017) 122:86-90), we obtain an improved version of the Cramer-Rao inequality for randomly censored data derived by Abdushukurov and Kim (J. Soviet. Math. (1987) pp. 2171-2185). We derive a lower bound of Bhattacharya type for the mean square error of a parametric function based on randomly censor...
متن کاملImproved Results on Models of Greedy and Primal-dual Algorithms
A class of priority algorithms that capture reasonable greedy-like algorithms was introduced by Borodin, Nielson, and Rackoff [7]. Later, Borodin, Cashman, and Magen [4] introduced the stack algorithms, advocating that they capture reasonable primal-dual and local-ratio algorithms. In this thesis, some NP -hard graph optimization problems Maximum Acyclic Subgraph (MAS) problem and Minimum Stein...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1212.0836 شماره
صفحات -
تاریخ انتشار 2012